Polarized Unification Grammars
نویسنده
چکیده
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG.
منابع مشابه
Meaning-Text Unification Grammar: modularity and polarization
This article presents the Meaning-Text Unification Grammar’s current state, now that its formal foundations have been clarified with the development of Polarized Unification Grammar. Emphasis is put on the model’s architecture and the role of polarization in linking its modules — semantics-syntax interface and the well-formedness grammars of each representation level.
متن کاملThe Non-associativity of Polarized Tree-Based Grammars
Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars (PUG). We show that attaching polarities to tree nodes renders the combination operation non-associative, and in practice leads to overgeneration. We first provide some examples of non-associative combination operators in exist...
متن کاملA French Interaction Grammar
Interaction Grammars (IGs) are a grammatical formalism which uses two fundamental concepts : underspecification and polarity [Per00, Per04]. These concepts apply to both syntax and semantics of natural languages but here, we only consider the syntactic level. In this context, underspecification essentially means underspecification of syntactic trees, and it is expressed using the notion of tree...
متن کاملHighly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, off-line parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity an...
متن کاملEstimators for Stochastic "Unification-Based" Grammars
Log-linear models provide a statistically sound framework for Stochastic “Unification-Based” Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a training corpus of syntactic analyses, and apply these to estimate a stochastic version of LexicalFunctional Grammar.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006